Using Simon's algorithm to attack symmetric-key cryptographic primitives
نویسندگان
چکیده
منابع مشابه
Using Simon's algorithm to attack symmetric-key cryptographic primitives
We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon’s algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives. Specifically, these examples consist of a quantum distinguisher for the 3-round Feistel network and a forgery attack on CBC-MAC which forges a tag for a c...
متن کاملOn the Round Security of Symmetric-Key Cryptographic Primitives
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of iterating simpler constructs for a number of rounds, and may provide insight into the security of such designs. We completely characterize the security of four-round Luby-Rackoff ciphers in our model, and show that t...
متن کاملCryptanalysis of Symmetric Cryptographic Primitives
Cryptanalysis of Symmetric Cryptographic Primitives Aleksandar Kircanski, Ph.D. Concordia University, 2013 Symmetric key cryptographic primitives are the essential building blocks in modern information security systems. The overall security of such systems is crucially dependent on these mathematical functions, which makes the analysis of symmetric key primitives a goal of critical importance. ...
متن کاملA Practical Attack on Some Braid Group Based Cryptographic Primitives
A simple heuristic approach to the conjugacy problem in braid groups is described. Although it does not provide a general solution to the latter problem, it demonstrates that various proposed key parameters for braid group based cryptographic primitives do not offer acceptable cryptographic security. We give experimental evidence that it is often feasible to reveal the secret data by means of a...
متن کاملAnonymity in shared symmetric key primitives
We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this level of anonymity. A new scheme is presented to share symmetric key operations amongst a set of participants according to a (t, n)-threshold access structure. We quantify the amount of information the output of the shared operation provides about t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2017
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic17.1-2-4